TSTP Solution File: SET196^5 by Leo-III-SAT---1.7.10

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.10
% Problem  : SET196^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  7 10:49:25 EDT 2024

% Result   : Theorem 2.38s 1.55s
% Output   : Refutation 2.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   10 (   4 unt;   3 typ;   0 def)
%            Number of atoms       :    4 (   0 equ;   0 cnn)
%            Maximal formula atoms :    1 (   0 avg)
%            Number of connectives :   20 (   3   ~;   0   |;   3   &;  11   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   2 usr;   2 con; 0-1 aty)
%            Number of variables   :    9 (   0   ^   9   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $tType ).

thf(sk1_type,type,
    sk1: a > $o ).

thf(sk3_type,type,
    sk3: a ).

thf(1,conjecture,
    ! [A: a > $o,B: a > $o,C: a] :
      ( ( ( A @ C )
        & ( B @ C ) )
     => ( A @ C ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_37_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: a > $o,B: a > $o,C: a] :
        ( ( ( A @ C )
          & ( B @ C ) )
       => ( A @ C ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: a > $o,B: a > $o,C: a] :
        ( ( ( A @ C )
          & ( B @ C ) )
       => ( A @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(6,plain,
    sk1 @ sk3,
    inference(cnf,[status(esa)],[3]) ).

thf(4,plain,
    ~ ( sk1 @ sk3 ),
    inference(cnf,[status(esa)],[3]) ).

thf(7,plain,
    $false,
    inference(rewrite,[status(thm)],[6,4]) ).

thf(8,plain,
    $false,
    inference(simp,[status(thm)],[7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET196^5 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.16  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n004.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Mon May  6 20:48:54 EDT 2024
% 0.16/0.37  % CPUTime  : 
% 0.97/0.87  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.19/0.99  % [INFO] 	 Parsing done (112ms). 
% 1.19/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.70/1.25  % [INFO] 	 nitpick registered as external prover. 
% 1.70/1.25  % [INFO] 	 Scanning for conjecture ... 
% 1.70/1.31  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.70/1.33  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.70/1.33  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.70/1.33  % [INFO] 	 Type checking passed. 
% 1.70/1.33  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 2.38/1.55  % [INFO] 	 Killing All external provers ... 
% 2.38/1.55  % Time passed: 1030ms (effective reasoning time: 551ms)
% 2.38/1.55  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.38/1.55  % Axioms used in derivation (0): 
% 2.38/1.55  % No. of inferences in proof: 7
% 2.38/1.55  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1030 ms resp. 551 ms w/o parsing
% 2.38/1.57  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.38/1.57  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------